Structural operational semantics for non-deterministic processes with quantitative aspects

نویسندگان

  • Marino Miculan
  • Marco Peressotti
چکیده

General frameworks have been recently proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools. This paper provides two contributions in this respect. First, we present a general GSOS specification format and a corresponding notion of bisimulation for non-deterministic processes with quantitative aspects. These specifications define labelled transition systems according to the ULTraS model, an extension of the usual LTSs where the transition relation associates any source state and transition label with state reachability weight functions (like, e.g., probability distributions). This format, hence called Weight Function GSOS (WF-GSOS), covers many known systems and their bisimulations (e.g. PEPA, TIPP, PCSP) and GSOS formats (e.g. GSOS, Weighted GSOS, Segala-GSOS, among others). The second contribution is a characterization of these systems as coalgebras of a class of functors, parametric on the weight structure. This result allows us to prove soundness and completeness of the WF-GSOS specification format, and that bisimilarities induced by these specifications are always congruences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Truly Concurrent Process Calculus over Recyclable Resources

In this paper we present a truly concurrent semantics for deterministic concurrent recursive processes accessing quantified recyclable resources. The process semantics is built upon the new coherently complete and prime algebraic domain of continued multi-pomsets, which is a quantitative version of the domain of complex resource pomsets. The CSP-like process language that we study contains seve...

متن کامل

Compositional Semantics of Non-Deterministic Synchronous Languages

A key feature of synchronous languages is that they conciliate con-currency with determinism. This is achieved by detecting so-called causality errors BG92, HM95, STB95], which occur when the composition of deterministic processes is not deterministic. Although the existing synchronous languages only deal with deterministic programs, it is not a restriction of the approach. We show how a synchr...

متن کامل

A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources

This paper develops a truly concurrent semantical approach, whereby concurrency is notionally independent of nondeterminism, that allows describing the deterministically concurrent behaviour of recursive processes accessing consumable resources. The process semantics is based on the new coherently complete and prime algebraic domains of real and complex multi-pomsets. The process language that ...

متن کامل

A Sound and Complete SOS-Semantics for Non-Distributed Deterministic Abstract State Machines

In this paper we present a sound and complete Structural Operational Semantics (SOS) for non-distributed deterministic Abstract State Machines (ASMs). Since ASMs exhibit both sequential and parallel features, the semantics is structured into two layers. One layer describes the parallel execution of updates, the other layer describes the sequential execution of rules. The semantics has some nice...

متن کامل

Structural operational semantics for continuous state stochastic transition systems

In this paper we show how to model syntax and semantics of stochastic processes with continuous states, respectively as algebras and coalgebras of suitable endofunctors over the category of measurable spaces Meas. Moreover, we present an SOS-like rule format, called MGSOS, representing abstract GSOS over Meas, and yielding fully abstract universal semantics, for which behavioral equivalence is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 655  شماره 

صفحات  -

تاریخ انتشار 2016